Second-Order Schemas and Active Subschemas: Vowel Reduction in Cognitive Grammar

Reduction of Second Order Systems Using Second Order Krylov Subspaces

By introducing the second order Krylov subspace, a method for the reduction of second order systems is proposed leading to a reduced system of the same structure. This generalization of Krylov subspace involves two matrices and some starting vectors and the reduced order model is found by applying a projection directly to the second order model without any conversion to state space. A numerical...

Grammar Transfer in a Second Order Recurrent Neural Network

It has been known that people, after being exposed to sentences generated by an artificial grammar, acquire implicit grammatical knowledge and are able to transfer the knowledge to inputs that are generated by a modified grammar. We show that a second order recurrent neural network is able to transfer grammatical knowledge from one language (generated by a Finite State Machine) to another langu...

6 Model Reduction of Second - Order Systems

Model reduction of second order systems

where the matrix M ∈ RN×N is assumed to be invertible. Models of mechanical systems are often of this type since (1.1) then represents the equation of motion of the system. For such a system M = MT , C = CT and K = KT are respectively the mass, damping and stiffness matrices, f(t) ∈ RN×1 is the vector of external forces, and x(t) ∈ RN×1 is the vector of internal generalized coordinates (see [4]...

Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas

A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. Two schemas are strongly equivalent if they always define the same function from initial states to final states for every interpretation. A subschema of a sche...